Active queue control scheme for achieving approximately fair bandwidth allocation
نویسندگان
چکیده
| We propose a bu®er management mechanism, called V-WFQ (Virtual Weighted Fair Queueing), for achieving approximately fair bandwidth allocation with a small hardware amount in high-speed networks. The basic process for allocating bandwidth fairly uses selective packet dropping to compare the measured input rate of the °ow with an estimated fair bandwidth share. Though V-WFQ is a hardwaree±cient FIFO-based algorithm, it can achieve almost ideal fairness in bandwidth allocation. Simulation results show that V-WFQ achieves a good balance between fairness and link utilization under various simulation conditions.
منابع مشابه
A stateless active queue management scheme for approximating fair bandwidth allocation
We investigate the problem of providing a fair bandwidth allocation to each of flows that share the outgoing link of a congested router. The buffer at the outgoing link is a simple FIFO, shared by packets belonging to the flows. We devise a simple packet dropping scheme, called CHOKe, that discriminates against the flows which submit more packets/sec than is allowed by their fair share. By doin...
متن کاملActive Queue Management for Fair Bandwidth Allocation of Mixed Responsive and Non-Responsive Traffic Using a Closed-Loop Congestion Control Scheme
Today’s known and widely used active queue management (AQM) schemes do not differentiate between packets from responsive (e.g., TCP sessions) and non-responsive traffic (e.g., UDP). This results in further widening the gap of unfair advantage already inherent to non-responsive traffic, as the responsive sender will significantly reduce its future transmit rate as a result of the congestion sign...
متن کاملCHOKE, A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation
We investigate the problem of providing a fair bandwidth allocation to each of n flows that share the outgoing link of a congested router. The buffer at the outgoing link is a simple FIFO, shared by packets belonging to the n flows. We devise a simple packet dropping scheme, called CHOKe, that discriminates against the flows which submit more packets/sec than is allowed by their fair share. By ...
متن کاملAn Efficient Scheme of General Weighted Fair Allocation for Enhanced Best-Effort Service in High Speed Networks
This research is focused on enhanced best-effort service, which provides the minimum bandwidth guarantee and distributes the available bandwidth fairly to packet flows in a high speed network. These goals can be reached when the bandwidth allocation is general weighted (GW) fair among the flows. GW fairness ensures the minimum rate for every flow and, furthermore, allocates the excess bandwidth...
متن کاملA new bandwidth sharing scheme for non-responsive multicast flows
In this work, we propose a new active queue management mechanism called MFQ (Multicast Fair Queuing) for multicast flows. MFQ is independent of the inter-multicast fairness policy and it interacts with a multicast bandwidth allocation module that can implement either a multicast fairness policy or a multicast pricing model and tries using a single FIFO queue to achieve the expected allocation w...
متن کامل